traversal of binary tree

英

美

网络二叉树的遍历

Recursive and non recursive implementation of binary tree traversal, the use of queues to achieve the level of binary tree traversal.
利用递归和非递归实现二叉树的中序遍历，利用队列实现二叉树的层次遍历。
By careful researches of the traversal of binary tree, a new method of traversing binary tree is brought forward, which is able to solve the problem of traversal of binary tree.
对二叉树的遍历过程进行深入地研究，提出一种生成二叉树遍历序列的新方法，解决了二叉树遍历序列的生成问题。
The average running time of the recursive traversal algorithm of binary tree
二叉树递归遍历算法的平均运行时间
Postorder-traversal algorithm of binary tree based on EREW
基于EREW的后序遍历二叉树算法
This paper proves that the average running time of the recursive traversal algorithm of stochastic binary tree does not go beyond ( n3+ 6n2+ 11n)/ 18. Here, n is the number of nodes in the tree.
本文证明了对由随机插入结点而逐渐产生的二叉树进行遍历的递归算法的平均运行时间少于等于（n3＋6n2十11n）／18，其中n为树的结点数。
The pre order, in order and post order traversal of every binary tree are unique, but those of different binary trees may be identical.
但是不同的二叉树的先序遍历序列或中序遍历序列或后序遍历序列有可能是相同的。